Similarity-Based Classification in Partially Labeled Networks

We propose a similarity-based method, using the similarity between nodes, to address the problem of classification in partially labeled networks. The basic assumption is that two nodes are more likely to be categorized into the same class if they are more similar. In this paper, we introduce ten similarity indices, including five local ones and five global ones. Empirical results on the co-purchase network of political books show that the similarity-based method can give high accurate classification even when the labeled nodes are sparse which is one of the difficulties in classification. Furthermore, we find that when the target network has many labeled nodes, the local indices can perform as good as those global indices do, while when the data is sparce the global indices perform better. Besides, the similarity-based method can to some extent overcome the unconsistency problem which is another difficulty in classification.Comment: 13 pages,3 figures,1 tabl

The reinforcing influence of recommendations on global diversification

Recommender systems are promising ways to filter the overabundant information in modern society. Their algorithms help individuals to explore decent items, but it is unclear how they allocate popularity among items. In this paper, we simulate successive recommendations and measure their influence on the dispersion of item popularity by Gini coefficient. Our result indicates that local diffusion and collaborative filtering reinforce the popularity of hot items, widening the popularity dispersion. On the other hand, the heat conduction algorithm increases the popularity of the niche items and generates smaller dispersion of item popularity. Simulations are compared to mean-field predictions. Our results suggest that recommender systems have reinforcing influence on global diversification.Comment: 6 pages, 6 figure

Similarity from multi-dimensional scaling: solving the accuracy and diversity dilemma in information filtering

Recommender systems are designed to assist individual users to navigate through the rapidly growing amount of information. One of the most successful recommendation techniques is the collaborative filtering, which has been extensively investigated and has already found wide applications in e-commerce. One of challenges in this algorithm is how to accurately quantify the similarities of user pairs and item pairs. In this paper, we employ the multidimensional scaling (MDS) method to measure the similarities between nodes in user-item bipartite networks. The MDS method can extract the essential similarity information from the networks by smoothing out noise, which provides a graphical display of the structure of the networks. With the similarity measured from MDS, we find that the item-based collaborative filtering algorithm can outperform the diffusion-based recommendation algorithms. Moreover, we show that this method tends to recommend unpopular items and increase the global diversification of the networks in long term

Study of market model describing the contrary behaviors of informed and uninformed agents: Being minority and being majority

In this paper we analyze the contrary behaviors of the informed investors and uniformed investors, and then construct a competition model with two groups of agents, namely agents who intend to stay in minority and those who intend to stay in majority. We find two kinds of competitions, inter- and intra-groups. The model shows periodic fluctuation feature. The average distribution of strategies illustrates a prominent central peak which is relevant to the peak-fat-tail character of price change distribution in stock markets. Furthermore, in the modified model the tolerance time parameter makes the agents diversified. Finally, we compare the strategies distribution with the price change distribution in real stock market, and we conclude that contrary behavior rules and tolerance time parameter are indeed valid in the description of market model

Membership in social networks and the application in information filtering

During the past few years, users' membership in the online system (i.e. the social groups that online users joined) were widely investigated. Most of these works focus on the detection, formulation and growth of online communities. In this paper, we study users' membership in a coupled system which contains user-group and user-object bipartite networks. By linking users' membership information and their object selection, we find that the users who have collected only a few objects are more likely to be "influenced” by the membership when choosing objects. Moreover, we observe that some users may join many online communities though they collected few objects. Based on these findings, we design a social diffusion recommendation algorithm which can effectively solve the user cold-start problem. Finally, we propose a personalized combination of our method and the hybrid method in [T. Zhou, Z. Kuscsik, J.G. Liu, M. Medo, J.R. Wakeling, Y.C. Zhang, Proc. Natl. Acad. Sci. 107, 4511 (2010)], which leads to a further improvement in the overall recommendation performanc

Collaborative filtering with diffusion-based similarity on tripartite graphs

Collaborative tags are playing more and more important role for the organization of information systems. In this paper, we study a personalized recommendation model making use of the ternary relations among users, objects and tags. We propose a measure of user similarity based on his preference and tagging information. Two kinds of similarities between users are calculated by using a diffusion-based process, which are then integrated for recommendation. We test the proposed method in a standard collaborative filtering framework with three metrics: ranking score, Recall and Precision, and demonstrate that it performs better than the commonly used cosine similarity.Comment: 8 pages, 4 figures, 1 tabl